Liste Des Participants

Thomas Brihaye Université de Mons-Hainaut Model-Checking, bisimulation and word combinatorics. Abstract. In this talk we explain briefly what model-checking is. Then we recall the notion of bisimulation and explain why the study of bisimulations is relevant in the context of model-checking. In particular we focus on bisimulations of dynamical systems and we explain how the dynamics of these systems can be recovered through some words encoding. This technique leads to nice finiteness results for o-minimal dynamical systems. In this talk we explain briefly what model-checking is. Then we recall the notion of bisimulation and explain why the study of bisimulations is relevant in the context of model-checking. In particular we focus on bisimulations of dynamical systems and we explain how the dynamics of these systems can be recovered through some words encoding. This technique leads to nice finiteness results for o-minimal dynamical systems.